Low-Rank Alternating Direction Implicit Iteration in pyMOR
نویسندگان
چکیده
منابع مشابه
Implicit Alternating Direction Methods
in general plane regions and with respect to linear boundary conditions, is a classical problem of numerical analysis. Many such boundary value problems have been solved successfully on high-speed computing machines, using the (iterative) Young-Frankel "successive overrelaxation" (SOR) method as defined in [l] and [2], and variants thereof ("line" and "block" overrelaxation). For this method, e...
متن کاملAn Alternating Direction Implicit Method for Modeling of Fluid Flow
This research includes of the numerical modeling of fluids in two-dimensional cavity. The cavity flow is an important theoretical problem. In this research, modeling was carried out based on an alternating direction implicit via Vorticity-Stream function formulation. It evaluates different Reynolds numbers and grid sizes. Therefore, for the flow field analysis and prove of the ability of the sc...
متن کاملSparse and Low-rank Matrix Decomposition via Alternating Direction Methods
The problem of recovering the sparse and low-rank components of a matrix captures a broad spectrum of applications. Authors in [4] proposed the concept of ”rank-sparsity incoherence” to characterize the fundamental identifiability of the recovery, and derived practical sufficient conditions to ensure the high possibility of recovery. This exact recovery is achieved via solving a convex relaxati...
متن کاملSparse and Low-Rank Matrix Decomposition Via Alternating Direction Method
The problem of recovering sparse and low-rank components of a given matrix captures a broad spectrum of applications. However, this recovery problem is NP-hard and thus not tractable in general. Recently, it was shown in [3, 6] that this recovery problem can be well approached by solving a convex relaxation problem where the l1-norm and the nuclear norm are used to induce sparse and low-rank st...
متن کاملTitle Fast positive-real balanced truncation via quadratic alternating direction implicit iteration
Balanced truncation (BT), as applied to date in model order reduction (MOR), is known for its superior accuracy and computable error bounds. Positive-real BT (PRBT) is a particular BT procedure that preserves passivity and stability and imposes no structural constraints on the original state space. However, PRBT requires solving two algebraic Riccati equations (AREs), whose computational comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: GAMM Archive for Students
سال: 2020
ISSN: 2626-9724
DOI: 10.14464/gammas.v2i1.420